Regenerative cascade homotopies for solving polynomial systems

A key step in the numerical computation of the irreducible decomposition of a polynomial system is the computation of a witness superset of the solution set. In many problems involving a solution set of a polynomial system, the witness superset contains all the needed information. Sommese and Wampler gave the first numerical method to compute witness supersets, based on dimension-by-dimension slicing of the solution set by generic linear spaces, followed later by the cascade homotopy of Sommese and Verschelde. Recently, the authors of this article introduced a new method, regeneration, to compute solution sets of polynomial systems. Tests showed that combining regeneration with the dimension-by-dimension algorithm was significantly faster than naively combining it with the cascade homotopy. However, in this article, we combine an appropriate randomization of the polynomial system with the regeneration technique to construct a new cascade of homotopies for computing witness supersets. Computational tests give strong evidence that regenerative cascade is superior in practice to previous methods.     

Explicit solution of the finite time L2-norm polynomial approximation problem

The aim of this paper is to present a new approach to the finite time L₂-norm polynomial approximation problem. A new formulation of this problem leads to an equivalent linear system whose solution can be investigated analytically. Such a solution is then specialized for a polynomial expressed in terms of Laguerre and Bernstein basis.     

Classification of hypersurfaces with constant Laguerre eigenvalues in R~n

Let x:M → Rn be an umbilical free hypersurface with non-zero principal curvatures.Then x is associated with a Laguerre metric g,a Laguerre tensor L,a Laguerre form C,and a Laguerre second fundamental form B,which are invariants of x under Laguerre transformation group.An eigenvalue of Laguerre tensor L of x is called a Laguerre eigenvalue of x.In this paper,we classify all oriented hypersurfaces with constant Laguerre eigenvalues and vanishing Laguerre form.     

Choiceless polynomial time

Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish between isomorphic structures and compute exactly PTime properties? This question can be recast as follows: Does there exist a logic that captures polynomial time (without presuming the presence of a linear order)? Earlier, one of us conjectured a negative answer. The problem motivated a quest for stronger and stronger PTime logics. All these logics avoid arbitrary choice. Here we attempt to capture the choiceless fragment of PTime. Our computation model is a version of abstract state machines (formerly called evolving algebras). The idea is to replace arbitrary choice with parallel execution. The resulting logic expresses all properties expressible in any other PTime logic in the literature. A more difficult theorem shows that the logic does not capture all of PTime.     

A high-order finite volume method for systems of conservation laws—Multi-dimensional Optimal Order Detection (MOOD)

In this paper, we investigate an original way to deal with the problems generated by the limitation process of high-order finite volume methods based on polynomial reconstructions. Multi-dimensional Optimal Order Detection (MOOD) breaks away from classical limitations employed in high-order methods. The proposed method consists of detecting problematic situations after each time update of the solution and of reducing the local polynomial degree before recomputing the solution. As multi-dimensional MUSCL methods, the concept is simple and independent of mesh structure. Moreover MOOD is able to take physical constraints such as density and pressure positivity into account through an “a posteriori” detection. Numerical results on classical and demanding test cases for advection and Euler system are presented on quadrangular meshes to support the promising potential of this approach.     

Binding energy of an off-center donor impurity in ellipsoidal quantum dot with parabolic confinement potential

The binding energy of an off-center hydrogenic donor impurity in weakly oblate Ellipsoidal Quantum Dot (EQD), using the expansion method within the framework of effective mass approximation in strong confinement, is investigated. In this regard, the binding energies of different states of GaAs structures, as functions of the donor position and ellipticity parameter, are calculated. The results show that variations of binding energies are proportional to the ellipticity constant, the dot dimension and the location of impurity.     

On Growth of Polynomials with Restricted Zeros

Let P(z) be a polynomial of degree n which does not vanish in |z| k, k ≥ 1.It is known that for each 0 ≤ s n and 1 ≤ R ≤ k,M (P~(s), R )≤( 1/(R~s+ k~s))[{d~((s)/dx(s))(1+x~n)}_(x=1)]((R+k)/(1+k))~nM(P,1).In this paper, we obtain certain extensions and refinements of this inequality by involving binomial coefficients and some of the coefficients of the polynomial P(z).     

红外光谱发射率测量系统的温漂修正方法

针对探测器光谱响应度温漂现象对红外光谱发射率测量系统重复性的影响,分析探测器温度与输出电压之间的变化规律,提出了基于多项式拟合的光谱响应度温漂修正方法。研究探测器自身温度与其光谱响应度的函数关系,对探测器光谱响应度随温度变化的曲线进行数据拟合,得到探测器温度-光谱响应度的拟合方程,计算光谱响应度的温漂修正系数,修正探测器的输出电压,消除光谱响应度温漂现象对探测器输出电压造成的影响。研制光谱响应度温漂修正装置,测得探测器光谱响度的温漂曲线,对比指数拟合曲线和多项式拟合曲线与测量曲线的吻合度,结果表明6阶多项式拟合曲线的一致性较好,提高了基于积分球反射计的光谱发射率测量系统的重复性。     

Non-intrusive hybrid interval method for uncertain nonlinear systems using derivative information

This paper proposes a new non-intrusive hybrid interval method using derivative information for the dynamic response analysis of nonlinear systems with uncertain-butbounded parameters and/or initial conditions. This method provides tighter solution ranges compared to the existing polynomial approximation interval methods. Interval arithmetic using the Chebyshev basis and interval arithmetic using the general form modified affine basis for polynomials are developed to obtain tighter bounds for interval computation.To further reduce the overestimation caused by the "wrapping effect" of interval arithmetic, the derivative information of dynamic responses is used to achieve exact solutions when the dynamic responses are monotonic with respect to all the uncertain variables. Finally, two typical numerical examples with nonlinearity are applied to demonstrate the effectiveness of the proposed hybrid interval method, in particular, its ability to effectively control the overestimation for specific timepoints.